1,698 research outputs found
Effects of Time Horizons on Influence Maximization in the Voter Dynamics
In this paper we analyze influence maximization in the voter model with an
active strategic and a passive influencing party in non-stationary settings. We
thus explore the dependence of optimal influence allocation on the time
horizons of the strategic influencer. We find that on undirected heterogeneous
networks, for short time horizons, influence is maximized when targeting
low-degree nodes, while for long time horizons influence maximization is
achieved when controlling hub nodes. Furthermore, we show that for short and
intermediate time scales influence maximization can exploit knowledge of
(transient) opinion configurations. More in detail, we find two rules. First,
nodes with states differing from the strategic influencer's goal should be
targeted. Second, if only few nodes are initially aligned with the strategic
influencer, nodes subject to opposing influence should be avoided, but when
many nodes are aligned, an optimal influencer should shadow opposing influence.Comment: 22 page
Robust execution of service workflows using redundancy and advance reservations
In this paper, we develop a novel algorithm that allows service consumers to execute business processes (or workflows) of interdependent services in a dependable manner within tight time-constraints. In particular, we consider large inter-organisational service-oriented systems, where services are offered by external organisations that demand financial remuneration and where their use has to be negotiated in advance using explicit service-level agreements (as is common in Grids and cloud computing). Here, different providers often offer the same type of service at varying levels of quality and price. Furthermore, some providers may be less trustworthy than others, possibly failing to meet their agreements. To control this unreliability and ensure end-to-end dependability while maximising the profit obtained from completing a business process, our algorithm automatically selects the most suitable providers. Moreover, unlike existing work, it reasons about the dependability properties of a workflow, and it controls these by using service redundancy for critical tasks and by planning for contingencies. Finally, our algorithm reserves services for only parts of its workflow at any time, in order to retain flexibility when failures occur. We show empirically that our algorithm consistently outperforms existing approaches, achieving up to a 35-fold increase in profit and successfully completing most workflows, even when the majority of providers fail
Flexible Service Provisioning with Advance Agreements
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic and uncertain computational service economies. In contrast to existing work, our algorithm reasons explicitly about the impact of failures on the overall feasibility of a workflow, and it mitigates them by proactively provisioning multiple providers in parallel for particularly critical tasks and by explicitly planning for contingencies. Furthermore, our algorithm provisions only part of its workflow at any given time, in order to retain flexibility and to decrease the potential for missing negotiated service time slots. We show empirically that current approaches are unable to achieve a high utility in such uncertain and dynamic environments; whereas our algorithm consistently outperforms them over a range of environments. Specifically, our approach can achieve up to a 27-fold increase in utility and successfully completes most workflows within a strict deadline, even when the majority of providers do not honour their contracts
Sensitivity Analysis of Flexible Provisioning
This technical report contains a sensitivity analysis to extend our previous work. We show that our flexible service provisioning strategy is robust to inaccurate performance information (when the available information is within 10% of the true value), and that it degrades gracefully as the information becomes less accurate. We also identify and discuss one particular case where inaccurate information may lead to undesirable losses in highly unreliable environments
An Effective Strategy for the Flexible Provisioning of Service Workflows
Recent advances in service-oriented frameworks and semantic Web technologies have enabled software agents to discover and invoke resources over large distributed systems, in order to meet their high-level objectives. However, most work has failed to acknowledge that such systems are complex and dynamic multi-agent systems, where service providers act autonomously and follow their own decision-making procedures. Hence, the behaviour of these providers is inherently uncertain - services may fail or take uncertain amounts of time to complete. In this work, we address this uncertainty and take an agent-oriented approach to the problem of provisioning service providers for the constituent tasks of abstract workflows. Specifically, we describe an algorithm that uses redundancy to deal with unreliable providers, and we demonstrate that it achieves an 8-14% improvement in average utility over previous work, while performing up to 6 times as well as approaches that do not consider service uncertainty. We also show that our algorithm performs well in the presence of inaccurate service performance information
Gesture Typing on Virtual Tabletop: Effect of Input Dimensions on Performance
The association of tabletop interaction with gesture typing presents interaction potential for situationally or physically impaired users. In this work, we use depth cameras to create touch surfaces on regular tabletops. We describe our prototype system and report on a supervised learning approach to fingertips touch classification. We follow with a gesture typing study that compares our system with a control tablet scenario and explore the influence of input size and aspect ratio of the virtual surface on the text input performance. We show that novice users perform with the same error rate at half the input rate with our system as compared to the control condition, that an input size between A5 and A4 present the best tradeoff between performance and user preference and that users' indirect tracking ability seems to be the overall performance limiting factor
- …